منابع مشابه
Shortest Path through Random Points
Let (M, g1) be a compact d-dimensional Riemannian manifold. Let Xn be a set of n sample points in M drawn randomly from a Lebesgue density f . Define two points x, y ∈ M . We prove that the normalized length of the power-weighted shortest path between x, y passing through Xn converges to the Riemannian distance between x, y under the metric gp = f g1, where p > 1 is the power parameter. The res...
متن کاملRandom assignment and shortest path problems
The purpose of this article is to bring together some results on random assignment and shortest path problems, and to clarify how they relate to each other. In particular, we investigate the consequences of the two very different and hard proofs of the ζ(2) limit theorem for the random assignment problem given by David Aldous [1] and by Chandra Nair, Balaji Prabhakar and Mayank Sharma [11]. The...
متن کاملShortest path problem of uncertain random network
The shortest path problem is one of the most fundamental problems in network optimization. This paper is concerned with shortest path problems in non-deterministic environment, in which the lengths of some arcs have stochastic characteristics and meanwhile some have uncertain characteristics. In order to investigate paths in these networks, this paper introduces the chance distribution of minim...
متن کاملShortest-path metric approximation for random subgraphs
We consider graph optimization problems where the cost of a solution depends only on the shortest-path metric in the graph, such as Steiner Tree or Traveling Salesman. We study a scenario where such a problem needs to be solved repeatedly on random subgraphs of a given graph G. With the goal of speeding up the repeated queries and saving space, we describe the construction of a sparse subgraph ...
متن کاملFinding objects through stochastic shortest path problems
This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using offthe-shelf domain-independent probabilistic planners. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2016
ISSN: 1050-5164
DOI: 10.1214/15-aap1162